Lecture 5 — 10 February, 2014: ``5. Properties of the Lasserre Relaxation.''
نویسندگان
چکیده
http://www.csc.kth.se/~lauria/sos14/ Disclaimer: this lecture note has not yet been reviewed by the main lecturer. It is released as it is for the convenience of the students. In this lecture, we study the properties of the solution vectors of the Lasserre relaxation. We start with some basic properties of the solutions, and then continue to show that the solution vectors give us a family of locally consistent distributions over feasible integral local solutions. At the end of the lecture, we see an example of this property in graph coloring.
منابع مشابه
The Lasserre hierarchy in Approximation algorithms
The Lasserre hierarchy is a systematic procedure to strengthen a relaxation for an optimization problem by adding additional variables and SDP constraints. In the last years this hierarchy moved into the focus of researchers in approximation algorithms as the obtain relaxations have provably nice properties. In particular on the t-th level, the relaxation can be solved in time n ) and every con...
متن کاملMath 140a: Foundations of Real Analysis I
1. Ordered Sets, Ordered Fields, and Completeness 1 1.1. Lecture 1: January 5, 2016 1 1.2. Lecture 2: January 7, 2016 4 1.3. Lecture 3: January 11, 2016 7 1.4. Lecture 4: January 14, 2014 9 2. Sequences and Limits 13 2.1. Lecture 5: January 19, 2016 13 2.2. Lecture 6: January 21, 2016 15 2.3. Lecture 7: January 26, 2016 18 2.4. Lecture 8: January 28, 2016 21 3. Extensions of R: the Extended Rea...
متن کاملApproximating (Unweighted) Tree Augmentation via Lift-and-Project (Part 0: $1.8+ε$ approximation for (Unweighted) TAP)
We study the unweighted Tree Augmentation Problem (TAP) via the Lasserre (Sum of Squares) system. We prove an approximation guarantee of (1.8 + ) relative to an SDP relaxation, which matches the combinatorial approximation guarantee of Even, Feldman, Kortsarz and Nutov in ACM TALG (2009), where > 0 is a constant. We generalize the combinatorial analysis of integral solutions of Even, et al., to...
متن کاملGraph Isomorphism and the Lasserre Hierarchy
In this paper we show lower bounds for a certain large class of algorithms solving the Graph Isomorphism problem, even on expander graph instances. Spielman [25] shows an algorithm for isomorphism of strongly regular expander graphs that runs in time exp{Õ(n 13 )} (this bound was recently improved to exp{Õ(n 15 )} [5]). It has since been an open question to remove the requirement that the graph...
متن کاملLecture 9 — 3 March, 2014: ``9. Graph Isomorphism and the Lasserre Hierarchy.''
http://www.csc.kth.se/~lauria/sos14/ Let G and H be two graphs, we say that two graphs are isomorphic, denoted as G ≅ H, if there is a bijection π ∶ V(G) → V(H), such that {u, v} ∈ E(G) if and only if {π(u), π(v)} ∈ E(H). In this lecture, we discuss a recent paper by O’Donnell, Wright, Wu and Zhou 1 which proved the 1 R. O’Donnell, J. Wright, C. Wu, and Y. Zhou. Hardness of Robust Graph Isomorp...
متن کامل